984D - XOR-pyramid - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll n;
    cin >> n;
    ll a[n+1];
    for (int k=1; k<=n; k++){
        cin >> a[k];
    }
	int dp[n+1][n+1]={};
	int dp1[n+1][n+1]={};
	for(int k=1;k<=n;k++){
		dp1[1][k]=a[k],
		dp[1][k]=a[k];
	}
    for (int k=2; k<=n; k++){
        for (int i=n-k+1; i>=1; i--){
            dp[k][i]=(dp[k-1][i]^dp[k-1][i+1]);
        }
    }
    for (int k=2; k<=n; k++){
        for (int i=1; i<=n-k+1; i++){
            dp1[k][i]=max({dp[k][i],dp1[k-1][i],dp1[k-1][i+1]});
        }
    }
    ll t;
    cin  >> t;
    while (t--){
        ll a,b;
        cin >> a >> b;
        cout << dp1[b-a+1][a] << '\n';
    }
    return 0;
}